NP-Hardness of Some Linear Control Design Problems
نویسندگان
چکیده
منابع مشابه
Np-hardness of Some Linear Control Design Problems
We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by polynomial time algorithms. The problems that we consider include simultaneous stabilization by output feedback, stabilization by state or output feedback in the presence of bounds on the elements of the gain matrix, and decentralized control. These results are obtained by fi...
متن کاملNP-hardness of linear multiplicative programming and related problems
The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems.
متن کاملOn the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...
متن کاملOn Some Euclidean Clustering Problems: NP-Hardness and Efficient Approximation Algorithms
We consider some poorly studied clustering problems. The paper purpose is to present a short survey on some new results on the computational complexity of these problems, and on efficient algorithms with performance guarantees for their solutions.
متن کاملUnimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. – i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj . If we know interval bounds on some such characteristics ai ≤ ci(p) ≤ ai, and we are interested in a characteristic c(p),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1997
ISSN: 0363-0129,1095-7138
DOI: 10.1137/s0363012994272630